TSTP Solution File: NUM736^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : NUM736^1 : TPTP v8.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 11:54:49 EDT 2022
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 28 ( 16 unt; 9 typ; 0 def)
% Number of atoms : 61 ( 17 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 137 ( 7 ~; 6 |; 0 &; 122 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 0 ^ 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_frac,type,
frac: $tType ).
thf(tp_nat,type,
nat: $tType ).
thf(tp_den,type,
den: frac > nat ).
thf(tp_less,type,
less: nat > nat > $o ).
thf(tp_more,type,
more: nat > nat > $o ).
thf(tp_num,type,
num: frac > nat ).
thf(tp_ts,type,
ts: nat > nat > nat ).
thf(tp_x,type,
x: frac ).
thf(tp_y,type,
y: frac ).
thf(1,axiom,
! [Xx: nat,Xy: nat] :
( ( more @ Xx @ Xy )
=> ( less @ Xy @ Xx ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz11) ).
thf(2,axiom,
more @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(3,conjecture,
less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz42) ).
thf(4,negated_conjecture,
( ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[3]) ).
thf(5,plain,
( ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) )
= $false ),
inference(unfold_def,[status(thm)],[4]) ).
thf(6,plain,
( ( ! [Xx: nat,Xy: nat] :
( ( more @ Xx @ Xy )
=> ( less @ Xy @ Xx ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(7,plain,
( ( more @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(8,plain,
( ( ~ ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(9,plain,
( ( ! [Xx: nat,Xy: nat] :
( ~ ( more @ Xx @ Xy )
| ( less @ Xy @ Xx ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(10,plain,
( ( more @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
( ( ! [Xx: nat,Xy: nat] :
( ~ ( more @ Xx @ Xy )
| ( less @ Xy @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(12,plain,
( ( ~ ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(13,plain,
! [SV1: nat] :
( ( ! [SY2: nat] :
( ~ ( more @ SV1 @ SY2 )
| ( less @ SY2 @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(14,plain,
( ( less @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(15,plain,
! [SV2: nat,SV1: nat] :
( ( ~ ( more @ SV1 @ SV2 )
| ( less @ SV2 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(16,plain,
! [SV2: nat,SV1: nat] :
( ( ( ~ ( more @ SV1 @ SV2 ) )
= $true )
| ( ( less @ SV2 @ SV1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[15]) ).
thf(17,plain,
! [SV2: nat,SV1: nat] :
( ( ( more @ SV1 @ SV2 )
= $false )
| ( ( less @ SV2 @ SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(18,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[10,17,14]) ).
thf(19,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM736^1 : TPTP v8.1.0. Released v3.7.0.
% 0.11/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jul 6 12:04:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 2
% 0.13/0.35
% 0.13/0.35 Length.of.Defs: 0
% 0.13/0.35
% 0.13/0.35 Contains.Choice.Funs: false
% 0.13/0.35 (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:4,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.13/0.37 ********************************
% 0.13/0.37 * All subproblems solved! *
% 0.13/0.37 ********************************
% 0.13/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:18,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.37
% 0.13/0.37 %**** Beginning of derivation protocol ****
% 0.13/0.37 % SZS output start CNFRefutation
% See solution above
% 0.13/0.37
% 0.13/0.37 %**** End of derivation protocol ****
% 0.13/0.37 %**** no. of clauses in derivation: 19 ****
% 0.13/0.37 %**** clause counter: 18 ****
% 0.13/0.37
% 0.13/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:18,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------